Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولOrbitopal Fixing
The topic of this paper are integer programming models in which a subset of 0/1-variables encode a partitioning of a set of objects into disjoint subsets. Such models can be surprisingly hard to solve by branch-and-cut algorithms if the order of the subsets of the partition is irrelevant. This kind of symmetry unnecessarily blows up the branchand-cut tree. We present a general tool, called orbi...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولthe evaluation and comparison of two esp textbooks available on the iranian market for teaching english to the students of medicine
abstract this study evaluated and compared medical terminology and english for the students of medicine (ii) as two representatives of the textbooks available on the iranian market for teaching english to the students of medicine. this research was performed on the basis of a teacher’s and a number of students’ attitudes and the students’ needs analysis for two reasons: first, to investigate...
15 صفحه اولSolving the Unit Commitment Problem Using Modified Imperialistic Competition Algorithm
One of the most important problems for power system operation is unit commitment (UC), for which different constraints should be satisfied. UC is a nonlinear and large-scale problem; thus, using the evolutionary algorithms has been considered for solving the problem. In this paper, the solution of the UC problem was investigated using Modified Imperialistic Competition Algorithm (MICA). Simula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2019
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-019-01457-1